Circular avoiding sequences with prescribed sum
نویسندگان
چکیده
منابع مشابه
Avoiding-sequences with minimum sum
A circular sequence of postttve integers of length n IS a sequence of n terms m which the first and last are constdered consecutive. For x~n a positive integer, such a sequence IS x-avordmg tf no set of consecutive terms sums to x We show that an x-avoiding cucular sequence of length n satisfies al + a2 f + a,, r2n. and give a simple necessary and sufficient condmon for equahty Muumtzmg sequenc...
متن کاملAvoiding Zero-sum Subsequences of Prescribed Length over the Integers
Let t and k be a positive integers, and let Ik = {i ∈ Z : −k ≤ i ≤ k}. Let st(Ik) be the smallest positive integer ` such that every zero-sum sequence S over Ik of length |S| ≥ ` contains a zero-sum subsequence of length t. If no such ` exists, then let st(Ik) =∞. In this paper, we prove that st(Ik) is finite if and only if every integer in [1, D(Ik)] divides t, where D(Ik) = max{2, 2k − 1} is ...
متن کاملHamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
In [6], Thomassen conjectured that if I is a set of k − 1 arcs in a k-strong tournament T , then T − I has a Hamiltonian cycle. This conjecture was proved by Fraisse and Thomassen [3]. We prove the following stronger result. Let T = (V, A) be a k-strong tournament on n vertices and let X1, X2, . . . , Xl be a partition of the vertex set V of T such that |X1| ≤ |X2| ≤ . . . ≤ |Xl|. If k ≥ ∑l−1 i...
متن کاملFinding paths in graphs avoiding prescribed transitions
Let v be a vertex of a graph G; a transition graph T (v) of v is a graph whose vertices are the edges incident with v. We consider graphs G with prescribed transition systems T = { T (v) | v ∈ V (G) }. A path P in G is called T -compatible, if each pair uv, vw of consecutive edges of P form an edge in T (v). Let A be a given class of graphs (closed under isomorphism). We study the computational...
متن کاملZero-sum Free Sequences with Small Sum-set
Let A be a zero-sum free subset of Zn with |A| = k. We compute for k ≤ 7 the least possible size of the set of all subset-sums of A.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90166-l